Conditional Kolmogorov complexity and universal probability
نویسندگان
چکیده
منابع مشابه
Conditional Kolmogorov complexity and universal probability
The conditional in conditional Kolmogorov complexity commonly is taken to be a finite binary string. The Coding Theorem of L.A. Levin connects unconditional prefix Kolmogorov complexity with the discrete universal distribution. The least upper semicomputable code-length is up to a constant equal to the negative logarithm of the greatest lower semicomputable probability mass function. We investi...
متن کاملNon-reducible Descriptions for Conditional Kolmogorov Complexity
Assume that a program p on input a outputs b. We are looking for a shorter program q having the same property (q(a) = b). In addition, we want q to be simple conditional to p (this means that the conditional Kolmogorov complexity K (q|p) is negligible). In the present paper, we prove that sometimes there is no such program q, even in the case when the complexity of p is much bigger than K (b|a)...
متن کاملStrongly Universal Quantum Turing Machines and Invariance of Kolmogorov Complexity
We show that there exists a universal quantum Turing machine (UQTM) that can simulate every other QTM until the other QTM has halted and then halt itself with probability one. This extends work by Bernstein and Vazirani who have shown that there is a UQTM that can simulate every other QTM for an arbitrary, but preassigned number of time steps. As a corollary to this result, we give a rigorous p...
متن کاملDifferences between Kolmogorov Complexity and Solomonoff Probability: Consequences for AGI
Kolmogorov complexity and algorithmic probability are compared in the context of the universal algorithmic intelligence. Accuracy of time series prediction based on single best model and on averaging over multiple models is estimated. Connection between inductive behavior and multi-model prediction is established. Uncertainty as a heuristic for reducing the number of used models without losses ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.07.009